Confluent Vandermonde with Arnoldi
نویسندگان
چکیده
In this note, we extend the Vandermonde with Arnoldi method recently advocated by Brubeck et al. (2021) to dealing confluent matrix. To apply process, it is critical find a Krylov subspace which generates column space of A theorem established for such subspaces any order derivatives. This enables us compute derivatives high degree polynomials precision. It also makes many applications involving possible, as illustrated numerical examples. We note that one approaches orthogonalizes only function values and equivalent formula given Trefethen (2022). The other approach Hermite data. About preferable another, made comparison, result problem dependent.
منابع مشابه
Stability analysis of algorithms for solving confluent Vandermonde-like systems
A confluent Vandermonde-like matrix P(a0, a, an) is a generalisation of the confluent Vandermonde matrix in which the monomials are replaced by arbitrary polynomials. For the case where the polynomials satisfy a three-term recurrence relation algorithms for solving the systems Px b and Pra f in O(n2) operations are derived. Forward and backward error analyses that provide bounds for the relativ...
متن کاملContinuous Stieltjes-Wigert Limiting Behaviour of a Family of Confluent q-Chu-Vandermonde Distributions
From Kemp [1], we have a family of confluent q-ChuVandermonde distributions, consisted by three members I, II and III, interpreted as a family of q-steady-state distributions from Markov chains. In this article, we provide the moments of the distributions of this family and we establish a continuous limiting behavior for the members I and II, in the sense of pointwise convergence, by applying a...
متن کاملLower bounds for the condition number of a real confluent Vandermonde matrix
Lower bounds on the condition number κp(Vc ) of a real confluent Vandermonde matrix Vc are established in terms of the dimension n or n and the largest absolute value among all nodes that define the confluent Vandermonde matrix or n and the interval that contains the nodes. In particular, it is proved that for any modest kmax (the largest number of equal nodes), κp(Vc ) behaves no smaller than ...
متن کاملVandermonde Matrices with Chebyshev Nodes
For n × n Vandermonde matrix Vn = (αi−1 j )1≤i j≤n with translated Chebyshev zero nodes, it is discovered that V T n admits an explicit QR decomposition with the R-factor consisting of the coefficients of the translated Chebyshev polynomials of degree less than n. This decomposition then leads to an exact expression for the condition number of its submatrix Vk,n = (αi−1 j )1≤i≤k,1≤j≤n (so-calle...
متن کاملVandermonde sets and super-Vandermonde sets
Given a set T ⊆ GF(q), |T | = t, wT is defined as the smallest positive integer k for which ∑ y∈T y k 6= 0. It can be shown that wT ≤ t always and wT ≤ t − 1 if the characteristic p divides t. T is called a Vandermonde set if wT ≥ t−1 and a super-Vandermonde set if wT = t. This (extremal) algebraic property is interesting for its own right, but the original motivation comes from finite geometri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2023
ISSN: ['1873-5452', '0893-9659']
DOI: https://doi.org/10.1016/j.aml.2022.108420